Asymptotic orbits of primitive substitutions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic orbits of primitive substitutions

A primitive, aperiodic substitution on d letters has at most d asymptotic orbits; this bound is sharp. Since asymptotic arc components in tiling spaces associated with substitutions are in 1-1 correspondence with asymptotic words, this provides a bound for those as

متن کامل

Balances for fixed points of primitive substitutions

An in!nite word de!ned over a !nite alphabet A is balanced if for any pair (!;!′) of factors of the same length and for any letter a in the alphabet ‖!|a − |!|a|6 1; where |!|a denotes the number of occurrences of the letter a in the word !. In this paper, we generalize this notion and introduce a measure of balance for an in!nite sequence. In the case of !xed points of primitive substitutions,...

متن کامل

Profinite Groups Associated with Weakly Primitive Substitutions

A uniformly recurrent pseudoword is an element of a free profinite semigroup in which every finite factor appears in every sufficiently long finite factor. An alternative characterization is as a pseudoword which is a factor of all its infinite factors, that is one which lies in a J -class with only finite words strictly J -above it. Such a J -class is regular and therefore it has an associated...

متن کامل

Group Membership for Groups with Primitive Orbits

This paper considers a permutation group G = 〈S〉 of degree n with t orbits such that the action on each orbit is primitive. It presents a O(tn2 logc(n)) time Monte Carlo group membership algorithm for some constant c. The algorithm is notable for its use of a new theorem showing how to find O(t log n) generators in O (̃|S|n) time under a more general form of the above hypotheses. The algorithm r...

متن کامل

Asymptotic Analysis of Displaced Lunar Orbits

Strathprints is designed to allow users to access the research output of the University of Strathclyde. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. You may not engage in further distribution of the material for any profitmaking activities or any commercial gain. You may freely distribute both the url (http://stra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00889-7